﻿#define _CRT_SECURE_NO_WARNINGS 1

//动态规划第七题
//LCR 166. 珠宝的最高价值
//https://leetcode.cn/problems/li-wu-de-zui-da-jie-zhi-lcof/description/

class Solution {
public:
    int jewelleryValue(vector<vector<int>>& frame) {
        // 状态表示
        // dp[i][j]表示到[i,j]路径的最大价值
        int m = frame.size();
        int n = frame[0].size();
        vector<vector<int>> dp(m + 1, vector<int>(n + 1));

        dp[1][1] = frame[0][0];

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] = max(dp[i - 1][j] + frame[i - 1][j - 1],
                    dp[i][j - 1] + frame[i - 1][j - 1]);
            }
        }
        return dp[m][n];
    }
};